Interaction between intra prediction mode and block differential pulse-code modulation mode

ABSTRACT

A method of video encoding includes determining whether a first block associated with a second block is to be predicted according to a block differential pulse code modulation (BDPCM) mode, and, in response to determining that the first block is to be predicted according to the BDPCM mode, associating the first block with an intra prediction mode value based on a BDPCM direction for the first block. The intra prediction mode value is selected from a plurality of intra prediction modes that include angular intra prediction modes. The method also includes determining an intra prediction mode value for the second block using the intra prediction mode value associated with the first block, and encoding the second block using the determined intra prediction mode value for the second block.

INCORPORATION BY REFERENCE

The present application claims the benefit of priority to U.S. patentapplication Ser. No. 16/862,221, filed on Apr. 29, 2020, which claimsthe benefit of priority to U.S. Provisional Application No. 62/841,003,“INTERACTION BETWEEN INTRA PREDICTION MODE AND BLOCK DIFFERENTIALPULSE-CODE MODULATION MODE” filed on Apr. 30, 2019. The disclosures ofthe prior applications are hereby incorporated by reference in theirentirety.

TECHNICAL FIELD

The present disclosure describes embodiments generally related to videocoding.

BACKGROUND

The background description provided herein is for the purpose ofgenerally presenting the context of the disclosure. Work of thepresently named inventors, to the extent the work is described in thisbackground section, as well as aspects of the description that may nototherwise qualify as prior art at the time of filing, are neitherexpressly nor impliedly admitted as prior art against the presentdisclosure.

Video coding and decoding can be performed using inter-pictureprediction with motion compensation. Uncompressed digital video caninclude a series of pictures, each picture having a spatial dimensionof, for example, 1920×1080 luminance samples and associated chrominancesamples. The series of pictures can have a fixed or variable picturerate (informally also known as frame rate), of, for example 60 picturesper second or 60 Hz. Uncompressed video has significant bitraterequirements. For example, 1080p60 4:2:0 video at 8 bit per sample(1920×1080 luminance sample resolution at 60 Hz frame rate) requiresclose to 1.5 Gbit/s bandwidth. An hour of such video requires more than600 GBytes of storage space.

One purpose of video coding and decoding can be the reduction ofredundancy in the input video signal, through compression. Compressioncan help reduce the aforementioned bandwidth or storage spacerequirements, in some cases by two orders of magnitude or more. Bothlossless and lossy compression, as well as a combination thereof can beemployed. Lossless compression refers to techniques where an exact copyof the original signal can be reconstructed from the compressed originalsignal. When using lossy compression, the reconstructed signal may notbe identical to the original signal, but the distortion between originaland reconstructed signals is small enough to make the reconstructedsignal useful for the intended application. In the case of video, lossycompression is widely employed. The amount of distortion tolerateddepends on the application; for example, users of certain consumerstreaming applications may tolerate higher distortion than users oftelevision distribution applications. The compression ratio achievablecan reflect that: higher allowable/tolerable distortion can yield highercompression ratios.

A video encoder and decoder can utilize techniques from several broadcategories, including, for example, motion compensation, transform,quantization, and entropy coding.

Video codec technologies can include techniques known as intra coding.In intra coding, sample values are represented without reference tosamples or other data from previously reconstructed reference pictures.In some video codecs, the picture is spatially subdivided into blocks ofsamples. When all blocks of samples are coded in intra mode, thatpicture can be an intra picture. Intra pictures and their derivationssuch as independent decoder refresh pictures, can be used to reset thedecoder state and can, therefore, be used as the first picture in acoded video bitstream and a video session, or as a still image. Thesamples of an intra block can be exposed to a transform, and thetransform coefficients can be quantized before entropy coding. Intraprediction can be a technique that minimizes sample values in thepre-transform domain. In some cases, the smaller the DC value after atransform is, and the smaller the AC coefficients are, the fewer thebits that are required at a given quantization step size to representthe block after entropy coding.

Traditional intra coding such as known from, for example MPEG-2generation coding technologies, does not use intra prediction. However,some newer video compression technologies include techniques thatattempt, from, for example, surrounding sample data and/or metadataobtained during the encoding/decoding of spatially neighboring, andpreceding in decoding order, blocks of data. Such techniques arehenceforth called “intra prediction” techniques. Note that in at leastsome cases, intra prediction is only using reference data from thecurrent picture under reconstruction and not from reference pictures.

There can be many different forms of intra prediction. When more thanone of such techniques can be used in a given video coding technology,the technique in use can be coded in an intra prediction mode. Incertain cases, modes can have submodes and/or parameters, and those canbe coded individually or included in the mode codeword. Which codewordto use for a given mode/submode/parameter combination can have an impactin the coding efficiency gain through intra prediction, and so can theentropy coding technology used to translate the codewords into abitstream.

A certain mode of intra prediction was introduced with H.264, refined inH.265, and further refined in newer coding technologies such as jointexploration model (JEM), versatile video coding (VVC), and benchmark set(BMS). A predictor block can be formed using neighboring sample valuesbelonging to already available samples. Sample values of neighboringsamples are copied into the predictor block according to a direction. Areference to the direction in use can be coded in the bitstream or mayitself be predicted.

Referring to FIG. 1A, depicted in the lower right is a subset of ninepredictor directions known from H.265's 33 possible predictor directions(corresponding to the 33 angular modes of the 35 intra modes). The pointwhere the arrows converge (101) represents the sample being predicted.The arrows represent the direction from which the sample is beingpredicted. For example, arrow (102) indicates that sample (101) ispredicted from a sample or samples to the upper right, at a 45 degreeangle from the horizontal. Similarly, arrow (103) indicates that sample(101) is predicted from a sample or samples to the lower left of sample(101), in a 22.5 degree angle from the horizontal.

Still referring to FIG. 1A, on the top left there is depicted a squareblock (104) of 4×4 samples (indicated by a dashed, boldface line). Thesquare block (104) includes 16 samples, each labelled with an “S”, itsposition in the Y dimension (e.g., row index) and its position in the Xdimension (e.g., column index). For example, sample S21 is the secondsample in the Y dimension (from the top) and the first (from the left)sample in the X dimension. Similarly, sample S44 is the fourth sample inblock (104) in both the Y and X dimensions. As the block is 4×4 samplesin size, S44 is at the bottom right. Further shown are reference samplesthat follow a similar numbering scheme. A reference sample is labelledwith an R, its Y position (e.g., row index) and X position (columnindex) relative to block (104). In both H.264 and H.265, predictionsamples neighbor the block under reconstruction; therefore no negativevalues need to be used.

Intra picture prediction can work by copying reference sample valuesfrom the neighboring samples as appropriated by the signaled predictiondirection. For example, assume the coded video bitstream includessignaling that, for this block, indicates a prediction directionconsistent with arrow (102)—that is, samples are predicted from aprediction sample or samples to the upper right, at a 45 degree anglefrom the horizontal. In that case, samples S41, S32, S23, and S14 arepredicted from the same reference sample R05. Sample S44 is thenpredicted from reference sample R08.

In certain cases, the values of multiple reference samples may becombined, for example through interpolation, in order to calculate areference sample; especially when the directions are not evenlydivisible by 45 degrees.

The number of possible directions has increased as video codingtechnology has developed. In H.264 (year 2003), nine different directioncould be represented. That increased to 33 in H.265 (year 2013), andJEM/VVC/BMS, at the time of disclosure, can support up to 65 directions.Experiments have been conducted to identify the most likely directions,and certain techniques in the entropy coding are used to represent thoselikely directions in a small number of bits, accepting a certain penaltyfor less likely directions. Further, the directions themselves cansometimes be predicted from neighboring directions used in neighboring,already decoded, blocks.

The intra prediction modes used in HEVC are illustrated in FIG. 1B. InHEVC, there are total 35 intra prediction modes, among which mode 10 ishorizontal mode, mode 26 is vertical mode, and mode 2, mode 18 and mode34 are diagonal modes. The intra prediction modes are signalled by threemost probable modes (MPMs) and 32 remaining modes.

FIG. 1C illustrates the intra prediction modes used in VVC. In VVC,there are total 95 intra prediction modes as shown in FIG. 1C, wheremode 18 is the horizontal mode, mode 50 is the vertical mode, and mode2, mode 34 and mode 66 are diagonal modes. Modes−1˜−14 and Modes 67˜80are called Wide-Angle Intra Prediction (WAIP) modes.

The mapping of intra prediction directions bits in the coded videobitstream that represent the direction can be different from videocoding technology to video coding technology; and can range, forexample, from simple direct mappings of prediction direction to intraprediction mode, to codewords, to complex adaptive schemes involvingMPMs, and similar techniques. In all cases, however, there can becertain directions that are statistically less likely to occur in videocontent than certain other directions. As the goal of video compressionis the reduction of redundancy, those less likely directions will, in awell working video coding technology, be represented by a larger numberof bits than more likely directions.

SUMMARY

According to an exemplary embodiment, a method of video decodingperformed in a video decoder includes determining whether a first blockassociated with a second block is coded with a block differential pulsecode modulation (BDPCM) mode. The method further includes, in responseto determining that the first block is coded with the BDPCM mode,associating the first block with an intra prediction mode value based ona BDPCM directional flag. The method further includes determining aninter prediction mode value for the second block using the intraprediction mode value associated with the first block. The methodfurther includes reconstructing the second block using the determinedintra prediction mode value.

According to an exemplary embodiment, a video decoder for video decodingincludes processing circuitry configured to: determine whether a firstblock associated with a second block is coded with a block differentialpulse code modulation (BDPCM) mode. In response to a determination thatthe first block is coded with the BDPCM mode, the processing circuitryis further configured to associate the first block with an intraprediction mode value based on a BDPCM directional flag. The processingcircuitry is further configured to determine an inter prediction modevalue for the second block using the intra prediction mode valueassociated with the first block. The processing circuitry is furtherconfigured to reconstruct the second block using the determined intraprediction mode value.

According to an exemplary embodiment, a non-transitory computer readablemedium having instructions stored therein, which when executed by aprocessor in a video decoder causes the processor to execute a methodthat includes determining whether a first block associated with a secondblock is coded with a block differential pulse code modulation (BDPCM)mode. The method further includes, in response to determining that thefirst block is coded with the BDPCM mode, associating the first blockwith an intra prediction mode value based on a BDPCM directional flag.The method further includes determining an inter prediction mode valuefor the second block using the intra prediction mode value associatedwith the first block. The method further includes reconstructing thesecond block using the determined intra prediction mode value.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosedsubject matter will be more apparent from the following detaileddescription and the accompanying drawings in which:

FIG. 1A is a schematic illustration of an exemplary subset of intraprediction modes;

FIG. 1B is an illustration of exemplary intra prediction directions.

FIG. 1C is an illustration of exemplary intra prediction directions.

FIG. 2 is a schematic illustration of a simplified block diagram of acommunication system (200) in accordance with an embodiment.

FIG. 3 is a schematic illustration of a simplified block diagram of acommunication system (300) in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of adecoder in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified block diagram of anencoder in accordance with an embodiment.

FIG. 6 shows a block diagram of an encoder in accordance with anotherembodiment.

FIG. 7 shows a block diagram of a decoder in accordance with anotherembodiment.

FIG. 8 is a schematic illustration of a current block and itssurrounding neighbors.

FIG. 9 is an illustration of an embodiment of a process performed by adecoder.

FIG. 10 is a schematic illustration of a computer system in accordancewith an embodiment of the present disclosure.

DETAILED DESCRIPTION OF EMBODIMENTS

FIG. 2 illustrates a simplified block diagram of a communication system(200) according to an embodiment of the present disclosure. Thecommunication system (200) includes a plurality of terminal devices thatcan communicate with each other, via, for example, a network (250). Forexample, the communication system (200) includes a first pair ofterminal devices (210) and (220) interconnected via the network (250).In the FIG. 2 example, the first pair of terminal devices (210) and(220) performs unidirectional transmission of data. For example, theterminal device (210) may code video data (e.g., a stream of videopictures that are captured by the terminal device (210)) fortransmission to the other terminal device (220) via the network (250).The encoded video data can be transmitted in the form of one or morecoded video bitstreams. The terminal device (220) may receive the codedvideo data from the network (250), decode the coded video data torecover the video pictures and display video pictures according to therecovered video data. Unidirectional data transmission may be common inmedia serving applications and the like.

In another example, the communication system (200) includes a secondpair of terminal devices (230) and (240) that performs bidirectionaltransmission of coded video data that may occur, for example, duringvideoconferencing. For bidirectional transmission of data, in anexample, each terminal device of the terminal devices (230) and (240)may code video data (e.g., a stream of video pictures that are capturedby the terminal device) for transmission to the other terminal device ofthe terminal devices (230) and (240) via the network (250). Eachterminal device of the terminal devices (230) and (240) also may receivethe coded video data transmitted by the other terminal device of theterminal devices (230) and (240), and may decode the coded video data torecover the video pictures and may display video pictures at anaccessible display device according to the recovered video data.

In the FIG. 2 example, the terminal devices (210), (220), (230) and(240) may be illustrated as servers, personal computers and smart phonesbut the principles of the present disclosure may be not so limited.Embodiments of the present disclosure find application with laptopcomputers, tablet computers, media players and/or dedicated videoconferencing equipment. The network (250) represents any number ofnetworks that convey coded video data among the terminal devices (210),(220), (230) and (240), including for example wireline (wired) and/orwireless communication networks. The communication network (250) mayexchange data in circuit-switched and/or packet-switched channels.Representative networks include telecommunications networks, local areanetworks, wide area networks and/or the Internet. For the purposes ofthe present discussion, the architecture and topology of the network(250) may be immaterial to the operation of the present disclosureunless explained herein below.

FIG. 3 illustrates, as an example for an application for the disclosedsubject matter, the placement of a video encoder and a video decoder ina streaming environment. The disclosed subject matter can be equallyapplicable to other video enabled applications, including, for example,video conferencing, digital TV, storing of compressed video on digitalmedia including CD, DVD, memory stick and the like, and so on.

A streaming system may include a capture subsystem (313), that caninclude a video source (301), for example a digital camera, creating forexample a stream of video pictures (302) that are uncompressed. In anexample, the stream of video pictures (302) includes samples that aretaken by the digital camera. The stream of video pictures (302),depicted as a bold line to emphasize a high data volume when compared toencoded video data (304) (or coded video bitstreams), can be processedby an electronic device (320) that includes a video encoder (303)coupled to the video source (301). The video encoder (303) can includehardware, software, or a combination thereof to enable or implementaspects of the disclosed subject matter as described in more detailbelow. The encoded video data (304) (or encoded video bitstream (304)),depicted as a thin line to emphasize the lower data volume when comparedto the stream of video pictures (302), can be stored on a streamingserver (305) for future use. One or more streaming client subsystems,such as client subsystems (306) and (308) in FIG. 3 can access thestreaming server (305) to retrieve copies (307) and (309) of the encodedvideo data (304). A client subsystem (306) can include a video decoder(310), for example, in an electronic device (330). The video decoder(310) decodes the incoming copy (307) of the encoded video data andcreates an outgoing stream of video pictures (311) that can be renderedon a display (312) (e.g., display screen) or other rendering device (notdepicted). In some streaming systems, the encoded video data (304),(307), and (309) (e.g., video bitstreams) can be encoded according tocertain video coding/compression standards. Examples of those standardsinclude ITU-T Recommendation H.265. In an example, a video codingstandard under development is informally known as Versatile Video Coding(VVC). The disclosed subject matter may be used in the context of VVC.

It is noted that the electronic devices (320) and (330) can includeother components (not shown). For example, the electronic device (320)can include a video decoder (not shown) and the electronic device (330)can include a video encoder (not shown) as well.

FIG. 4 shows a block diagram of a video decoder (410) according to anembodiment of the present disclosure. The video decoder (410) can beincluded in an electronic device (430). The electronic device (430) caninclude a receiver (431) (e.g., receiving circuitry). The video decoder(410) can be used in the place of the video decoder (310) in the FIG. 3example.

The receiver (431) may receive one or more coded video sequences to bedecoded by the video decoder (410); in the same or another embodiment,one coded video sequence at a time, where the decoding of each codedvideo sequence is independent from other coded video sequences. Thecoded video sequence may be received from a channel (401), which may bea hardware/software link to a storage device which stores the encodedvideo data. The receiver (431) may receive the encoded video data withother data, for example, coded audio data and/or ancillary data streams,that may be forwarded to their respective using entities (not depicted).The receiver (431) may separate the coded video sequence from the otherdata. To combat network jitter, a buffer memory (415) may be coupled inbetween the receiver (431) and an entropy decoder/parser (420) (“parser(420)” henceforth). In certain applications, the buffer memory (415) ispart of the video decoder (410). In others, it can be outside of thevideo decoder (410) (not depicted). In still others, there can be abuffer memory (not depicted) outside of the video decoder (410), forexample to combat network jitter, and in addition another buffer memory(415) inside the video decoder (410), for example to handle playouttiming. When the receiver (431) is receiving data from a store/forwarddevice of sufficient bandwidth and controllability, or from anisosynchronous network, the buffer memory (415) may not be needed, orcan be small. For use on best effort packet networks such as theInternet, the buffer memory (415) may be required, can be comparativelylarge and can be advantageously of adaptive size, and may at leastpartially be implemented in an operating system or similar elements (notdepicted) outside of the video decoder (410).

The video decoder (410) may include the parser (420) to reconstructsymbols (421) from the coded video sequence. Categories of those symbolsinclude information used to manage operation of the video decoder (410),and potentially information to control a rendering device such as arender device (412) (e.g., a display screen) that is not an integralpart of the electronic device (430) but can be coupled to the electronicdevice (430), as was shown in FIG. 4 . The control information for therendering device(s) may be in the form of Supplemental EnhancementInformation (SEI messages) or Video Usability Information (VUI)parameter set fragments (not depicted). The parser (420) mayparse/entropy-decode the coded video sequence that is received. Thecoding of the coded video sequence can be in accordance with a videocoding technology or standard, and can follow various principles,including variable length coding, Huffman coding, arithmetic coding withor without context sensitivity, and so forth. The parser (420) mayextract from the coded video sequence, a set of subgroup parameters forat least one of the subgroups of pixels in the video decoder, based uponat least one parameter corresponding to the group. Subgroups can includeGroups of Pictures (GOPs), pictures, tiles, slices, macroblocks, CodingUnits (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) andso forth. The parser (420) may also extract from the coded videosequence information such as transform coefficients, quantizer parametervalues, motion vectors, and so forth.

The parser (420) may perform an entropy decoding/parsing operation onthe video sequence received from the buffer memory (415), so as tocreate symbols (421).

Reconstruction of the symbols (421) can involve multiple different unitsdepending on the type of the coded video picture or parts thereof (suchas: inter and intra picture, inter and intra block), and other factors.Which units are involved, and how, can be controlled by the subgroupcontrol information that was parsed from the coded video sequence by theparser (420). The flow of such subgroup control information between theparser (420) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (410)can be conceptually subdivided into a number of functional units asdescribed below. In a practical implementation operating undercommercial constraints, many of these units interact closely with eachother and can, at least partly, be integrated into each other. However,for the purpose of describing the disclosed subject matter, theconceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (451). Thescaler/inverse transform unit (451) receives a quantized transformcoefficient as well as control information, including which transform touse, block size, quantization factor, quantization scaling matrices,etc. as symbol(s) (421) from the parser (420). The scaler/inversetransform unit (451) can output blocks comprising sample values, thatcan be input into aggregator (455).

In some cases, the output samples of the scaler/inverse transform (451)can pertain to an intra coded block; that is: a block that is not usingpredictive information from previously reconstructed pictures, but canuse predictive information from previously reconstructed parts of thecurrent picture. Such predictive information can be provided by an intrapicture prediction unit (452). In some cases, the intra pictureprediction unit (452) generates a block of the same size and shape ofthe block under reconstruction, using surrounding already reconstructedinformation fetched from the current picture buffer (458). The currentpicture buffer (458) buffers, for example, partly reconstructed currentpicture and/or fully reconstructed current picture. The aggregator(455), in some cases, adds, on a per sample basis, the predictioninformation the intra prediction unit (452) has generated to the outputsample information as provided by the scaler/inverse transform unit(451).

In other cases, the output samples of the scaler/inverse transform unit(451) can pertain to an inter coded, and potentially motion compensatedblock. In such a case, a motion compensation prediction unit (453) canaccess reference picture memory (457) to fetch samples used forprediction. After motion compensating the fetched samples in accordancewith the symbols (421) pertaining to the block, these samples can beadded by the aggregator (455) to the output of the scaler/inversetransform unit (451) (in this case called the residual samples orresidual signal) so as to generate output sample information. Theaddresses within the reference picture memory (457) from where themotion compensation prediction unit (453) fetches prediction samples canbe controlled by motion vectors, available to the motion compensationprediction unit (453) in the form of symbols (421) that can have, forexample X, Y, and reference picture components. Motion compensation alsocan include interpolation of sample values as fetched from the referencepicture memory (457) when sub-sample exact motion vectors are in use,motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (455) can be subject to variousloop filtering techniques in the loop filter unit (456). Videocompression technologies can include in-loop filter technologies thatare controlled by parameters included in the coded video sequence (alsoreferred to as coded video bitstream) and made available to the loopfilter unit (456) as symbols (421) from the parser (420), but can alsobe responsive to meta-information obtained during the decoding ofprevious (in decoding order) parts of the coded picture or coded videosequence, as well as responsive to previously reconstructed andloop-filtered sample values.

The output of the loop filter unit (456) can be a sample stream that canbe output to the render device (412) as well as stored in the referencepicture memory (457) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used asreference pictures for future prediction. For example, once a codedpicture corresponding to a current picture is fully reconstructed andthe coded picture has been identified as a reference picture (by, forexample, the parser (420)), the current picture buffer (458) can becomea part of the reference picture memory (457), and a fresh currentpicture buffer can be reallocated before commencing the reconstructionof the following coded picture.

The video decoder (410) may perform decoding operations according to apredetermined video compression technology in a standard, such as ITU-TRec. H.265. The coded video sequence may conform to a syntax specifiedby the video compression technology or standard being used, in the sensethat the coded video sequence adheres to both the syntax of the videocompression technology or standard and the profiles as documented in thevideo compression technology or standard. Specifically, a profile canselect certain tools as the only tools available for use under thatprofile from all the tools available in the video compression technologyor standard. Also necessary for compliance can be that the complexity ofthe coded video sequence is within bounds as defined by the level of thevideo compression technology or standard. In some cases, levels restrictthe maximum picture size, maximum frame rate, maximum reconstructionsample rate (measured in, for example megasamples per second), maximumreference picture size, and so on. Limits set by levels can, in somecases, be further restricted through Hypothetical Reference Decoder(HRD) specifications and metadata for HRD buffer management signaled inthe coded video sequence.

In an embodiment, the receiver (431) may receive additional (redundant)data with the encoded video. The additional data may be included as partof the coded video sequence(s). The additional data may be used by thevideo decoder (410) to properly decode the data and/or to moreaccurately reconstruct the original video data. Additional data can bein the form of, for example, temporal, spatial, or signal noise ratio(SNR) enhancement layers, redundant slices, redundant pictures, forwarderror correction codes, and so on.

FIG. 5 shows a block diagram of a video encoder (503) according to anembodiment of the present disclosure. The video encoder (503) isincluded in an electronic device (520). The electronic device (520)includes a transmitter (540) (e.g., transmitting circuitry). The videoencoder (503) can be used in the place of the video encoder (303) in theFIG. 3 example.

The video encoder (503) may receive video samples from a video source(501) (that is not part of the electronic device (520) in the FIG. 5example) that may capture video image(s) to be coded by the videoencoder (503). In another example, the video source (501) is a part ofthe electronic device (520).

The video source (501) may provide the source video sequence to be codedby the video encoder (503) in the form of a digital video sample streamthat can be of any suitable bit depth (for example: 8 bit, 10 bit, 12bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ),and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb4:4:4). In a media serving system, the video source (501) may be astorage device storing previously prepared video. In a videoconferencingsystem, the video source (501) may be a camera that captures local imageinformation as a video sequence. Video data may be provided as aplurality of individual pictures that impart motion when viewed insequence. The pictures themselves may be organized as a spatial array ofpixels, wherein each pixel can comprise one or more samples depending onthe sampling structure, color space, etc. in use. A person skilled inthe art can readily understand the relationship between pixels andsamples. The description below focuses on samples.

According to an embodiment, the video encoder (503) may code andcompress the pictures of the source video sequence into a coded videosequence (543) in real time or under any other time constraints asrequired by the application. Enforcing appropriate coding speed is onefunction of a controller (550). In some embodiments, the controller(550) controls other functional units as described below and isfunctionally coupled to the other functional units. The coupling is notdepicted for clarity. Parameters set by the controller (550) can includerate control related parameters (picture skip, quantizer, lambda valueof rate-distortion optimization techniques, . . . ), picture size, groupof pictures (GOP) layout, maximum motion vector search range, and soforth. The controller (550) can be configured to have other suitablefunctions that pertain to the video encoder (503) optimized for acertain system design.

In some embodiments, the video encoder (503) is configured to operate ina coding loop. As an oversimplified description, in an example, thecoding loop can include a source coder (530) (e.g., responsible forcreating symbols, such as a symbol stream, based on an input picture tobe coded, and a reference picture(s)), and a (local) decoder (533)embedded in the video encoder (503). The decoder (533) reconstructs thesymbols to create the sample data in a similar manner as a (remote)decoder also would create (as any compression between symbols and codedvideo bitstream is lossless in the video compression technologiesconsidered in the disclosed subject matter). The reconstructed samplestream (sample data) is input to the reference picture memory (534). Asthe decoding of a symbol stream leads to bit-exact results independentof decoder location (local or remote), the content in the referencepicture memory (534) is also bit exact between the local encoder andremote encoder. In other words, the prediction part of an encoder “sees”as reference picture samples exactly the same sample values as a decoderwould “see” when using prediction during decoding. This fundamentalprinciple of reference picture synchronicity (and resulting drift, ifsynchronicity cannot be maintained, for example because of channelerrors) is used in some related arts as well.

The operation of the “local” decoder (533) can be the same as of a“remote” decoder, such as the video decoder (410), which has alreadybeen described in detail above in conjunction with FIG. 4 . Brieflyreferring also to FIG. 4 , however, as symbols are available andencoding/decoding of symbols to a coded video sequence by an entropycoder (545) and the parser (420) can be lossless, the entropy decodingparts of the video decoder (410), including the buffer memory (415), andparser (420) may not be fully implemented in the local decoder (533).

An observation that can be made at this point is that any decodertechnology except the parsing/entropy decoding that is present in adecoder also necessarily needs to be present, in substantially identicalfunctional form, in a corresponding encoder. For this reason, thedisclosed subject matter focuses on decoder operation. The descriptionof encoder technologies can be abbreviated as they are the inverse ofthe comprehensively described decoder technologies. Only in certainareas a more detail description is required and provided below.

During operation, in some examples, the source coder (530) may performmotion compensated predictive coding, which codes an input picturepredictively with reference to one or more previously-coded picture fromthe video sequence that were designated as “reference pictures”. In thismanner, the coding engine (532) codes differences between pixel blocksof an input picture and pixel blocks of reference picture(s) that may beselected as prediction reference(s) to the input picture.

The local video decoder (533) may decode coded video data of picturesthat may be designated as reference pictures, based on symbols createdby the source coder (530). Operations of the coding engine (532) mayadvantageously be lossy processes. When the coded video data may bedecoded at a video decoder (not shown in FIG. 5 ), the reconstructedvideo sequence typically may be a replica of the source video sequencewith some errors. The local video decoder (533) replicates decodingprocesses that may be performed by the video decoder on referencepictures and may cause reconstructed reference pictures to be stored inthe reference picture cache (534). In this manner, the video encoder(503) may store copies of reconstructed reference pictures locally thathave common content as the reconstructed reference pictures that will beobtained by a far-end video decoder (absent transmission errors).

The predictor (535) may perform prediction searches for the codingengine (532). That is, for a new picture to be coded, the predictor(535) may search the reference picture memory (534) for sample data (ascandidate reference pixel blocks) or certain metadata such as referencepicture motion vectors, block shapes, and so on, that may serve as anappropriate prediction reference for the new pictures. The predictor(535) may operate on a sample block-by-pixel block basis to findappropriate prediction references. In some cases, as determined bysearch results obtained by the predictor (535), an input picture mayhave prediction references drawn from multiple reference pictures storedin the reference picture memory (534).

The controller (550) may manage coding operations of the source coder(530), including, for example, setting of parameters and subgroupparameters used for encoding the video data.

Output of all aforementioned functional units may be subjected toentropy coding in the entropy coder (545). The entropy coder (545)translates the symbols as generated by the various functional units intoa coded video sequence, by lossless compressing the symbols according totechnologies such as Huffman coding, variable length coding, arithmeticcoding, and so forth.

The transmitter (540) may buffer the coded video sequence(s) as createdby the entropy coder (545) to prepare for transmission via acommunication channel (560), which may be a hardware/software link to astorage device which would store the encoded video data. The transmitter(540) may merge coded video data from the video coder (503) with otherdata to be transmitted, for example, coded audio data and/or ancillarydata streams (sources not shown).

The controller (550) may manage operation of the video encoder (503).During coding, the controller (550) may assign to each coded picture acertain coded picture type, which may affect the coding techniques thatmay be applied to the respective picture. For example, pictures oftenmay be assigned as one of the following picture types:

An Intra Picture (I picture) may be one that may be coded and decodedwithout using any other picture in the sequence as a source ofprediction. Some video codecs allow for different types of intrapictures, including, for example Independent Decoder Refresh (“IDR”)Pictures. A person skilled in the art is aware of those variants of Ipictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded anddecoded using intra prediction or inter prediction using at most onemotion vector and reference index to predict the sample values of eachblock.

A bi-directionally predictive picture (B Picture) may be one that may becoded and decoded using intra prediction or inter prediction using atmost two motion vectors and reference indices to predict the samplevalues of each block. Similarly, multiple-predictive pictures can usemore than two reference pictures and associated metadata for thereconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality ofsample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 sampleseach) and coded on a block-by-block basis. Blocks may be codedpredictively with reference to other (already coded) blocks asdetermined by the coding assignment applied to the blocks' respectivepictures. For example, blocks of I pictures may be codednon-predictively or they may be coded predictively with reference toalready coded blocks of the same picture (spatial prediction or intraprediction). Pixel blocks of P pictures may be coded predictively, viaspatial prediction or via temporal prediction with reference to onepreviously coded reference picture. Blocks of B pictures may be codedpredictively, via spatial prediction or via temporal prediction withreference to one or two previously coded reference pictures.

The video encoder (503) may perform coding operations according to apredetermined video coding technology or standard, such as ITU-T Rec.H.265. In its operation, the video encoder (503) may perform variouscompression operations, including predictive coding operations thatexploit temporal and spatial redundancies in the input video sequence.The coded video data, therefore, may conform to a syntax specified bythe video coding technology or standard being used.

In an embodiment, the transmitter (540) may transmit additional datawith the encoded video. The source coder (530) may include such data aspart of the coded video sequence. Additional data may comprisetemporal/spatial/SNR enhancement layers, other forms of redundant datasuch as redundant pictures and slices, SEI messages, VUI parameter setfragments, and so on.

A video may be captured as a plurality of source pictures (videopictures) in a temporal sequence. Intra-picture prediction (oftenabbreviated to intra prediction) makes use of spatial correlation in agiven picture, and inter-picture prediction makes uses of the (temporalor other) correlation between the pictures. In an example, a specificpicture under encoding/decoding, which is referred to as a currentpicture, is partitioned into blocks. When a block in the current pictureis similar to a reference block in a previously coded and still bufferedreference picture in the video, the block in the current picture can becoded by a vector that is referred to as a motion vector. The motionvector points to the reference block in the reference picture, and canhave a third dimension identifying the reference picture, in casemultiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in theinter-picture prediction. According to the bi-prediction technique, tworeference pictures, such as a first reference picture and a secondreference picture that are both prior in decoding order to the currentpicture in the video (but may be in the past and future, respectively,in display order) are used. A block in the current picture can be codedby a first motion vector that points to a first reference block in thefirst reference picture, and a second motion vector that points to asecond reference block in the second reference picture. The block can bepredicted by a combination of the first reference block and the secondreference block.

Further, a merge mode technique can be used in the inter-pictureprediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such asinter-picture predictions and intra-picture predictions are performed inthe unit of blocks. For example, according to the HEVC standard, apicture in a sequence of video pictures is partitioned into coding treeunits (CTU) for compression, the CTUs in a picture have the same size,such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTUincludes three coding tree blocks (CTBs), which are one luma CTB and twochroma CTBs. Each CTU can be recursively quadtree split into one ormultiple coding units (CUs). For example, a CTU of 64×64 pixels can besplit into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUsof 16×16 pixels. In an example, each CU is analyzed to determine aprediction type for the CU, such as an inter prediction type or an intraprediction type. The CU is split into one or more prediction units (PUs)depending on the temporal and/or spatial predictability. Generally, eachPU includes a luma prediction block (PB), and two chroma PBs. In anembodiment, a prediction operation in coding (encoding/decoding) isperformed in the unit of a prediction block. Using a luma predictionblock as an example of a prediction block, the prediction block includesa matrix of values (e.g., luma values) for pixels, such as 8×8 pixels,16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 6 shows a diagram of a video encoder (603) according to anotherembodiment of the disclosure. The video encoder (603) is configured toreceive a processing block (e.g., a prediction block) of sample valueswithin a current video picture in a sequence of video pictures, andencode the processing block into a coded picture that is part of a codedvideo sequence. In an example, the video encoder (603) is used in theplace of the video encoder (303) in the FIG. 3 example.

In an HEVC example, the video encoder (603) receives a matrix of samplevalues for a processing block, such as a prediction block of 8×8samples, and the like. The video encoder (603) determines whether theprocessing block is best coded using intra mode, inter mode, orbi-prediction mode using, for example, rate-distortion optimization.When the processing block is to be coded in intra mode, the videoencoder (603) may use an intra prediction technique to encode theprocessing block into the coded picture; and when the processing blockis to be coded in inter mode or bi-prediction mode, the video encoder(603) may use an inter prediction or bi-prediction technique,respectively, to encode the processing block into the coded picture. Incertain video coding technologies, merge mode can be an inter pictureprediction submode where the motion vector is derived from one or moremotion vector predictors without the benefit of a coded motion vectorcomponent outside the predictors. In certain other video codingtechnologies, a motion vector component applicable to the subject blockmay be present. In an example, the video encoder (603) includes othercomponents, such as a mode decision module (not shown) to determine themode of the processing blocks.

In the FIG. 6 example, the video encoder (603) includes the interencoder (630), an intra encoder (622), a residue calculator (623), aswitch (626), a residue encoder (624), a general controller (621), andan entropy encoder (625) coupled together as shown in FIG. 6 .

The inter encoder (630) is configured to receive the samples of thecurrent block (e.g., a processing block), compare the block to one ormore reference blocks in reference pictures (e.g., blocks in previouspictures and later pictures), generate inter prediction information(e.g., description of redundant information according to inter encodingtechnique, motion vectors, merge mode information), and calculate interprediction results (e.g., predicted block) based on the inter predictioninformation using any suitable technique. In some examples, thereference pictures are decoded reference pictures that are decoded basedon the encoded video information.

The intra encoder (622) is configured to receive the samples of thecurrent block (e.g., a processing block), in some cases compare theblock to blocks already coded in the same picture, generate quantizedcoefficients after transform, and in some cases also intra predictioninformation (e.g., an intra prediction direction information accordingto one or more intra encoding techniques). In an example, the intraencoder (622) also calculates intra prediction results (e.g., predictedblock) based on the intra prediction information and reference blocks inthe same picture.

The general controller (621) is configured to determine general controldata and control other components of the video encoder (603) based onthe general control data. In an example, the general controller (621)determines the mode of the block, and provides a control signal to theswitch (626) based on the mode. For example, when the mode is the intramode, the general controller (621) controls the switch (626) to selectthe intra mode result for use by the residue calculator (623), andcontrols the entropy encoder (625) to select the intra predictioninformation and include the intra prediction information in thebitstream; and when the mode is the inter mode, the general controller(621) controls the switch (626) to select the inter prediction resultfor use by the residue calculator (623), and controls the entropyencoder (625) to select the inter prediction information and include theinter prediction information in the bitstream.

The residue calculator (623) is configured to calculate a difference(residue data) between the received block and prediction resultsselected from the intra encoder (622) or the inter encoder (630). Theresidue encoder (624) is configured to operate based on the residue datato encode the residue data to generate the transform coefficients. In anexample, the residue encoder (624) is configured to convert the residuedata from a spatial domain to a frequency domain, and generate thetransform coefficients. The transform coefficients are then subject toquantization processing to obtain quantized transform coefficients. Invarious embodiments, the video encoder (603) also includes a residuedecoder (628). The residue decoder (628) is configured to performinverse-transform, and generate the decoded residue data. The decodedresidue data can be suitably used by the intra encoder (622) and theinter encoder (630). For example, the inter encoder (630) can generatedecoded blocks based on the decoded residue data and inter predictioninformation, and the intra encoder (622) can generate decoded blocksbased on the decoded residue data and the intra prediction information.The decoded blocks are suitably processed to generate decoded picturesand the decoded pictures can be buffered in a memory circuit (not shown)and used as reference pictures in some examples.

The entropy encoder (625) is configured to format the bitstream toinclude the encoded block. The entropy encoder (625) is configured toinclude various information according to a suitable standard, such asthe HEVC standard. In an example, the entropy encoder (625) isconfigured to include the general control data, the selected predictioninformation (e.g., intra prediction information or inter predictioninformation), the residue information, and other suitable information inthe bitstream. Note that, according to the disclosed subject matter,when coding a block in the merge submode of either inter mode orbi-prediction mode, there is no residue information.

FIG. 7 shows a diagram of a video decoder (710) according to anotherembodiment of the disclosure. The video decoder (710) is configured toreceive coded pictures that are part of a coded video sequence, anddecode the coded pictures to generate reconstructed pictures. In anexample, the video decoder (710) is used in the place of the videodecoder (310) in the FIG. 3 example.

In the FIG. 7 example, the video decoder (710) includes an entropydecoder (771), an inter decoder (780), a residue decoder (773), areconstruction module (774), and an intra decoder (772) coupled togetheras shown in FIG. 7 .

The entropy decoder (771) can be configured to reconstruct, from thecoded picture, certain symbols that represent the syntax elements ofwhich the coded picture is made up. Such symbols can include, forexample, the mode in which a block is coded (such as, for example, intramode, inter mode, bi-predicted mode, the latter two in merge submode oranother submode), prediction information (such as, for example, intraprediction information or inter prediction information) that canidentify certain sample or metadata that is used for prediction by theintra decoder (772) or the inter decoder (780), respectively, residualinformation in the form of, for example, quantized transformcoefficients, and the like. In an example, when the prediction mode isinter or bi-predicted mode, the inter prediction information is providedto the inter decoder (780); and when the prediction type is the intraprediction type, the intra prediction information is provided to theintra decoder (772). The residual information can be subject to inversequantization and is provided to the residue decoder (773).

The inter decoder (780) is configured to receive the inter predictioninformation, and generate inter prediction results based on the interprediction information.

The intra decoder (772) is configured to receive the intra predictioninformation, and generate prediction results based on the intraprediction information.

The residue decoder (773) is configured to perform inverse quantizationto extract de-quantized transform coefficients, and process thede-quantized transform coefficients to convert the residual from thefrequency domain to the spatial domain. The residue decoder (773) mayalso require certain control information (to include the QuantizerParameter (QP)), and that information may be provided by the entropydecoder (771) (data path not depicted as this may be low volume controlinformation only).

The reconstruction module (774) is configured to combine, in the spatialdomain, the residual as output by the residue decoder (773) and theprediction results (as output by the inter or intra prediction modulesas the case may be) to form a reconstructed block, that may be part ofthe reconstructed picture, which in turn may be part of thereconstructed video. It is noted that other suitable operations, such asa deblocking operation and the like, can be performed to improve thevisual quality.

It is noted that the video encoders (303), (503), and (603), and thevideo decoders (310), (410), and (710) can be implemented using anysuitable technique. In an embodiment, the video encoders (303), (503),and (603), and the video decoders (310), (410), and (710) can beimplemented using one or more integrated circuits. In anotherembodiment, the video encoders (303), (503), and (503), and the videodecoders (310), (410), and (710) can be implemented using one or moreprocessors that execute software instructions.

According to some embodiments, a size of Most Probable Mode (MPM) listis set equal to 6 for both an adjacent reference line (e.g., zeroreference line) and non-adjacent reference lines (e.g., non-zeroreference lines). The positions of neighboring modes used to derive 6MPM candidates may also be the same for adjacent and non-adjacentreference lines, which is illustrated in FIG. 8 . In FIG. 8 , the blockA and block B denote the above and left neighboring coding unit of acurrent block 800, and variables candIntraPredModeA andcandIntraPredModeB indicate the associated intra prediction modes ofblock A and B, respectively. Variables candIntraPredModeA andcandIntraPredModeB may initially be set equal to INTRA_PLANAR. If blockA (or B) is marked as available, candIntraPredModeA (orcandIntraPredModeB) may be set equal to the actual intra prediction modeof block A (or B).

The MPM candidate derivation process may be different for the adjacentand non-adjacent reference lines. For example, for a zero referenceline, if the modes for the two neighboring blocks are Planar or DC mode,default modes are used to construct the MPM list, where the first twocandidates are the Planar and DC modes, and the remaining four modes areangular modes (e.g., angular default modes). For non-zero referencelines, if the modes of the two neighboring blocks are Planar or DC mode,6 angular default modes may be used to construct the MPM list. Anembodiment of the MPM list derivation process is shown in Appendix 1,where candModeList[x] with x=0 . . . 5 denotes the 6 MPM candidates,IntraLumaRefLineIdx[xCb][yCb] denotes the reference line index of theblock to be predicted, and IntraLumaRefLineIdx[xCb][yCb] can be 0, 1, or3. In some examples, a unified intra mode coding approach is implementedwhere the planar mode is put as the first MPM.

Block Differential Pulse Code Modulation (BPDCM) is an intra-coding toolthat uses a differential pulse code modulation (DPCM) approach at ablock level. In some embodiments, a bdpcm_flag is transmitted at a CUlevel whenever it is a luma intra CU having each dimension smaller orequal to 32. This flag indicates whether regular intra coding or DPCM isused. This flag may be encoded using a single CABAC context.

In some embodiments, BDPCM uses a Median Edge Detector of LOCO-I (usedin JPEG-LS). For a current pixel X having pixel A as left neighbor,pixel B as top neighbor, and C as top-left neighbor, the prediction P(X)may be determined by:

$\begin{matrix}{{{P(X)} = {{{\min\left( {A,B} \right)}\mspace{14mu}{if}\mspace{14mu} C} \geq {\max\left( {A,B} \right)}}}\mspace{85mu}{{{\max\left( {A,B} \right)}\mspace{14mu}{if}\mspace{14mu} C} \leq {\min\left( {A,B} \right)}}\mspace{85mu}{A + B - {C\mspace{14mu}{otherwise}}}} & {{Eq}.\mspace{14mu}(1)}\end{matrix}$

The predictor may use unfiltered reference pixels when predicting fromthe top row and left column of the CU. The predictor then may usereconstructed pixels for the rest of the CU. Pixels may be processed inraster-scan order inside the CU. The prediction error may be quantizedin the spatial domain, after rescaling, in a way identical to aTransform Skip quantizer. Each pixel may be reconstructed by adding thedequantized prediction error to the prediction. Thus, the reconstructedpixels may be used to predict the next pixels in raster-scan order.Amplitude and signs of the quantized prediction error may be encodedseparately.

In some embodiments, a cbf_bdpcm_flag is coded. If this flag is equal to0, all amplitudes of the block may be decoded as zero. If this flag isequal to 1, all amplitudes of the block may be encoded individually inraster-scan order. In order to keep complexity low, in some examples,the amplitude may be limited to at most 31 (inclusive). The amplitudemay be encoded using unary binarization, with three contexts for thefirst bin, then one context for each additional bin until the 12th bin,and one context for all remaining bins. A sign may be encoded in bypassmode for each zero residue.

In some embodiments, to maintain the coherence of the regular intra modeprediction, the first mode in the MPM list is associated with aBlock-DPCM CU (without being transmitted) and is available for MPMgeneration for subsequent blocks. The deblocking filter may bede-activated on a border between two BDPCM blocks, since neither of theblocks uses the transform stage usually responsible for blockingartifacts. In some embodiments, BDPCM does not use any other step thanthe ones disclosed herein. For example, BPDCM does not use anytransform.

According to some embodiments, a BDPCM method uses reconstructed samplesto predict the rows or columns of a CU line by line. The signalled BDPCMdirection may indicate whether vertical or horizontal prediction isused. The reference pixels used may be unfiltered samples. Theprediction error may be quantized in the spatial domain. Pixels may bereconstructed by adding the dequantized prediction error to theprediction.

In some embodiments, as an alternative scheme to BDPCM, quantizedresidual domain BDPCM may be performed. The signalling and predictiondirections used in quantized residual BDPCM may be identical to a BPCMscheme. The intra prediction may be performed on an entire block bysample copying in a prediction direction (horizontal or verticalprediction) similar to intra prediction. The residual may be quantized,and the delta between the quantized residual and the quantizedresidual's predictor (horizontal or vertical) quantized value may becoded, which can be described in the following disclosed embodiments.

For a block of size M (rows)×N (cols), let r_(i,j), 0≤i≤M−1, 0≤j≤N−1 bethe prediction residual after performing intra prediction horizontally(copying left neighbor pixel value across the predicted block line byline) or vertically (copying top neighbor line to each line in thepredicted block) using unfiltered samples from above or left blockboundary samples. Let Q(r_(i,j)), 0≤i≤M−1, 0≤j≤N−1 denote the quantizedversion of the residual r_(i,j), where a residual is a differencebetween an original block and the predicted block values. Then, BDPCM isapplied to the quantized residual samples, resulting in a modified M×Narray {tilde over (R)} with elements {tilde over (r)}_(i,j). In someexamples, when vertical BDPCM is signalled:

$\begin{matrix}{{\overset{\sim}{r}}_{i,j} = \left\{ {\begin{matrix}{{Q\left( r_{i,j} \right)},} & {{i = 0},{0 \leq j \leq \left( {N - 1} \right)}} \\{{{Q\left( r_{i,j} \right)} - {Q\left( r_{{({i - 1})},j} \right)}},} & {{1 \leq i \leq \left( {M - 1} \right)},{0 \leq j \leq \left( {N - 1} \right)}}\end{matrix}.} \right.} & {{Eq}.\mspace{14mu}(2)}\end{matrix}$

In some examples, for horizontal prediction, similar rules apply, andthe residual quantized samples may be obtained by:

$\begin{matrix}{{\overset{\sim}{r}}_{i,j} = \left\{ {\begin{matrix}{{Q\left( r_{i,j} \right)},} & {{0 \leq i \leq \left( {M - 1} \right)},{j = 0}} \\{{{Q\left( r_{i,j} \right)} - {Q\left( r_{{({i - 1})},j} \right)}},} & {{0 \leq i \leq \left( {M - 1} \right)},{1 \leq j \leq \left( {N - 1} \right)}}\end{matrix}.} \right.} & {{Eq}.\mspace{14mu}(3)}\end{matrix}$

The residual quantized samples {tilde over (r)}_(i,j) may be sent to thedecoder. On the decoder side, in some examples the above calculationsare reversed to produce Q (r_(i,j)), 0≤i≤M−1, 0≤j≤N−1. In someembodiments, for a vertical prediction case:

$\begin{matrix}{{{Q\left( r_{i,j} \right)} = {\sum\limits_{k = 0}^{i}{\overset{\sim}{r}}_{k,j}}},{0 \leq i \leq \left( {M - 1} \right)},{0 \leq j \leq \left( {N - 1} \right)}} & {{Eq}.\mspace{14mu}(4)}\end{matrix}$

In some embodiments, for a horizontal prediction case:

$\begin{matrix}{{{Q\left( r_{i,j} \right)} = {\sum\limits_{k = 0}^{i}{\overset{\sim}{r}}_{k,j}}},{0 \leq i \leq \left( {M - 1} \right)},{0 \leq j \leq \left( {N - 1} \right)}} & {{Eq}.\mspace{14mu}(5)}\end{matrix}$

The inverse quantized residuals, Q⁻¹ (Q(r_(i,j))), may be added to theintra block prediction values to produce the reconstructed samplevalues. One advantage to this scheme is that the inverse DPCM may beperformed on the fly during coefficient parsing by adding the predictoras the coefficients are parsed or it can be performed after parsing.Therefore, the splitting of 4×N and N×4 blocks into 2 parallel processedblocks can be eliminated.

In some embodiments, a BDPCM coded block is associated with an intraprediction mode which is the first MPM (i.e., MPM0). As a result, whenderiving the MPM list, if a neighboring block is coded with BDPCM mode,its associated intra prediction mode (i.e., MPM0) is used. In addition,when a chroma block is coded using DM mode and the co-located luma blockis coded using a BDPCM mode, the intra prediction mode associated withthe co-located luma block (i.e., MPM0) is used as the intra predictionmode of the current chroma block.

Table 1 (below) illustrates an embodiment of the syntax and semantics ofthe BDPCM method.

TABLE 1 Descriptor coding_unit( x0, y0, cbWidth, cbHeight, treeType ) { if( tile_group_type != I | | sps_ibc_enabled_flag ) {   if( treeType !=DUAL_TREE_CHROMA )    cu_skip_flag[ x0 ][ y0 ] ae (v)   if(cu_skip_flag[ x0 ][ y0 ] = = 0 && tile_group_type != I )   pred_mode_flag ae (v)   if( ( ( tile_group_type = = I &&cu_skip_flag[ x0 ][ y0 ] = =0 ) | |    ( tile_group_type != I &&CuPredMode[ x0 ][ y0 ] != MODE_INTRA ) ) &&    sps_ibc_enabled_flag )   pred_mode_ibc_flag ae (v)  }  if( CuPredMode[ x0 ][ y0 ] = =MODE_INTRA ) {   if( pred_mode_flag = = MODE_INTRA && ( cIdx == 0 ) &&   ( cbWidth <= 32 ) && ( CbHeight <=32 )) {    bdpcm_flag[ x0 ][ y0 ]ae (v)    if( bdpcm_flag[ x0 ][ y0 ] ) {     bdpcm_dir_flag[ x0 ][ y0 ]ae (v)   }   else {   if( sps_pcm_enabled_flag &&    cbWidth >=MinIpcmCbSizeY && cbWidth <= MaxIpcmCbSizeY &&    cbHeight >=MinIpcmCbSizeY && cbHeight <= MaxIpcmCbSizeY )    pcm_flag[ x0 ][ y0 ]ae (v)   if( pcm_flag[ x0 ][ y0 ] ) {    while( !byte_aligned( ) )    pcm_alignment_zero_bit  f (1)    pcm_sample( cbWidth, cbHeight,treeType)   } else {    if( treeType = = SINGLE_TREE | | treeType = =DUAL_TREE_LUMA ) {     if( ( y0 % CtbSizeY ) > 0 )     intra_luma_ref_idx[ x0 ][ y0 ] ae (v)     if (intra_luma_ref_idx[x0 ][ y0 ] = = 0 &&      ( cbWidth <= MaxTbSizeY | | cbHeight <=MaxTbSizeY ) &&      ( cbWidth * cbHeight > MinTbSizeY * MinTbSizeY ))     intra_subpartitions_mode_flag[ x0 ][ y0 ] ae (v)     if(intra_subpartitions_mode_flag[ x0 ][ y0 ] = = 1 &&      cbWidth <=MaxTbSizeY && cbHeight <= MaxTbSizeY )     intra_subpartitions_split_flag[ x0 ][ y0 ] ae (v)     if(intra_luma_ref_idx[ x0 ][ y0 ] = = 0 &&     intra_subpartitions_mode_flag[ x0 ][ y0 ] = = 0 )     intra_luma_mpm_flag[ x0 ][ y0 ] ae (v)     if( intra_luma_mpm_flag[x0 ][ y0 ] )      intra_luma_mpm_idx[ x0 ][ y0 ] ae (v)     Else     intra_luma_mpm_remainder[ x0 ][ y0 ] ae (v)    }    }    if(treeType = = SINGLE_TREE | | treeType = = DUAL_TREE_CHROMA )    intra_chroma_pred_mode[ x0 ][ y0 ] ae (v)   }  } else if( treeType!= DUAL_TREE_CHROMA ) { /* MODE_INTER or MODE IBC */   ......  } }

In some embodiments, the variable bdpcm_flag[x0][y0] equal to 1specifies that a bdpcm_dir_flag is present in the coding unit includingthe luma coding block at the location (x0, y0). In some embodiments,bdpcm_dir_flag[x0][y0] equal to 0 specifies that the predictiondirection to be used in a bdpcm block is horizontal, otherwise theprediction direction is vertical.

As understood by one of ordinary skill in the art, BDPCM contributessignificant coding gain on screen video content, which is typicallyfeatured by strong edges. However, when BDPCM is jointly used with theMPM or DM modes, a BDPCM coded block is always associated with thePlanar mode, which may be harmful for coding gain on screen videocontent. Embodiments of the present disclosure resolve thesedisadvantages.

The embodiments of the present disclosure may be used separately orcombined in any order. Further, each of the methods, encoder, anddecoder according to the embodiments of the present disclosure may beimplemented by processing circuitry (e.g., one or more processors or oneor more integrated circuits). In one example, the one or more processorsexecute a program that is stored in a non-transitory computer-readablemedium. According to embodiments of the present disclosure, the termblock may be interpreted as a prediction block, a coding block, or acoding unit (i.e., CU).

According to some embodiments, when the bdpcm_dir_flag is equal to 0, ahorizontal prediction is used for BDPCM residual prediction, and whenthe bdpcm_dir_flag is equal to 1, the vertical prediction is used forBDPCM residual prediction. However, in other embodiments, the oppositeapproach also applies when the prediction directions of bdpcm_dir_flagbeing equal to 0 and 1 are swapped.

In some embodiments, the horizontal intra prediction mode is representedusing HOR_IDX, where in VVC, HOR_IDX corresponds to the intra predictionmode INTRA_ANGULAR18, and in HEVC, HOR_IDX corresponds to intraprediction mode INTRA_ANGULAR10. In some embodiments, the vertical intraprediction mode is represented using VER_IDX, where in VVC, VER_IDXcorresponds to the intra prediction mode INTRA_ANGULAR50, and in HEVC,VER_IDX corresponds to the intra prediction mode INTRa_ANGULAR26.

According to some embodiments, when deriving the most probable intraprediction modes, if a neighboring block is coded by BDPCM mode, theneighboring block is associated with an intra prediction mode ipm whichis derived using the value of bdpcm_dir_flag applied for this BDPCMcoded neighboring block as follows:ipm=bdpcm_dir_flag==0?HOR_IDX:VER_IDX,  Eq. (6)where HOR_IDX and VER_IDX represents the horizontal and vertical intraprediction mode, respectively, and bdpcm_dir_flag equals to 0 indicatesthat horizontal prediction is used for BDPCM residual prediction, andbdpcm_dir_flag equals to 1 indicates that vertical prediction is usedfor BDPCM residual prediction. After a value is assigned to intraprediction mode value ipm, this intra prediction mode value isconsidered as the neighboring block intra prediction mode and used forderiving the most probable intra prediction mode of a current block.

Appendix 2 illustrates an embodiment of the MPM list derivation processin which the bold portion illustrates how an intra prediction mode for aBDPCM coded block is determined based on the bdpcm_dir_flag. Exampleinput to this process may include: (i) a luma location (xCb, yCb)specifying the top-left sample of the current luma coding block relativeto the top left luma sample of the current picture, (ii) a variablecbWidth specifying the width of the current coding block in lumasamples, (iii) a variable cbHeight specifying the height of the currentcoding block in luma samples. In this process of Appendix 2, the lumaintra prediction mode IntraPredModeY[xCb][yCb] is derived.

Table 2 specifies the value for the intra prediction modeIntraPredModeY[xCb][yCb] and the associated names. In Table 2, in someexamples, the intra prediction modes INTRA_LT_CCLM, INTRA_L_CCLM andINTRA_T_CCLM, are only applicable to chroma components.

TABLE 2 Intra prediction mode Associated name 0 INTRA_PLANAR 1 INTRA_DC 2 . . . 66 INTRA_ANGULAR2 . . . INTRA_ANGULAR66 81 . . . 83INTRA_LT_CCLM, INTRA_L_CCLM, INTRA_T_CCLM

According to some embodiments, when deriving the intra prediction modeof a chroma block while the chroma block's co-located luma block iscoded using BDPCM mode, if the chroma block is predicted using DM mode,the intra prediction mode used for performing intra prediction mode ofthis chroma block is derived as follows,dm=bdpcm_dir_flag==0?HOR_IDX:VER_IDX,  Eq. (7)where HOR_IDX and VER_IDX represents the horizontal and vertical intraprediction mode, respectively, and bdpcm_dir_flag equals to 0 indicatesthat horizontal prediction is used for BDPCM residual prediction, andbdpcm_dir_flag equals to 1 indicates that vertical prediction is usedfor BDPCM residual prediction. Accordingly, after the value dm isassigned, this value is used as the intra prediction mode of the chromablock.

According to some embodiments, the context used for entropy coding thebdpcm_dir_flag depends on the value of bdpcm_dir_flag of neighboringblocks and/or whether the neighboring block is coded by the horizontalintra prediction mode or vertical intra prediction mode.

In one embodiment, only the bdpcm_dir_flag and bdpcm_flag values of aneighboring block is used for deriving the context applied for entropycoding the bdpcm_dir_flag of a current block. In one example, twoneighboring blocks are used (i.e., left is block A in FIG. 8 and top isblock B in FIG. 8 ), and the context value (ctx) is derived as follows:dpcm_left=dpcm_flag_(left)?(bdpcm_dir_flag_(left)?1:2):0  Eq. (8)dpcm_top=dpcm_flag_(top)?(bdpcm_dir_flag_(top)?1:2):0  Eq. (9)ctx=dpcm_left*3+dpcm_top,  Eq. (10)where dpcm_flag_(left) and dpcm_flag_(top) refer to the dpcm_flag of theleft and top neighboring blocks, respectively, and bdpcm_dir_flag_(left)and bdpcm_dir_flag_(top) refer to the bdpcm_dir_flag of the left and topneighboring blocks, respectively. After ctx is assigned, this value maybe used as an index for selecting one of a plurality of context models.

In addition to the previous example, the 9 contexts may be grouped in apre-defined manner resulting in less contexts being applied. Forexample, ctx=8 and ctx=7 in the previous example may be merged and onlyone context may be used for both of these ctx values.

In some embodiments, two neighboring blocks are used, (i.e., left andtop), and the context value (ctx) is derived as follows, wheredpcm_flag_(left) and dpcm_flag_(top) refer to the dpcm_flag of the leftand top neighboring blocks, respectively, and bdpcm_dir_flag_(left) andbdpcm_dir_flag_(top) refer to the bdpcm_dir_flag of the left and topneighboring blocks, respectively.dpcm_left=dpcm_flag_(left)?(bdpcm_dir_flag_(left)?1:2):0  Eq. (11)dpcm_top=dpcm_flag_(top)?(bdpcm_dir_flag_(top)?1:2):0  Eq. (12)ctx=(dpcm_left==dpcm_top)?dpcm_left:0.  Eq. (13)

FIG. 9 illustrates an embodiment of a process performed by a decodersuch as video decoder (710). The process may start at step (S900) todetermine whether a first block associated with a second block is codedin the BDPCM mode. In some examples, the first block may be a block thatis a spatial neighbor of a second block located in the same picture asthe first block. In other examples, the first block may be a luma blockand the second block is a chroma block, where the luma block isco-located with the chroma block.

If the first block is coded in the BDPCM mode, the process proceeds fromstep (S900) to step (S902), where the first block is associated with anintra prediction mode value based on a BDPCM directional flag. Forexample, bdpcm_flag may indicate that a block is coded in the BDPCMmode, and bdpcm_dir_flag may be used to determine whether to use thehorizontal direction or vertical direction. The process proceeds to step(S904) to determine an inter prediction mode value for the second blockusing the intra prediction mode value associated with the first block.For example, based on the BDPCM directional flag, the intra predictionmode value may be one of a horizontal intra prediction mode value and avertical intra prediction mode value. Furthermore, if the first block isa spatial neighbor of the second block, the intra prediction mode valueof the first block may be used for creating a MPM list, where the MPMlist is used for deriving the intra prediction mode value of the secondblock. Additionally, if the second block is a chroma block that ispredicted using the DM mode, and the first block is a co-located lumablock, the intra prediction mode value of the second block may bedetermined based on the intra prediction mode value of the first block.

The process proceeds to step (S906) where the second block isreconstructed using the determined intra prediction mode value of thesecond block. The process illustrated in FIG. 9 may terminate after step(S906) is completed. Furthermore, returning to step (S900), if the firstblock is not coded in BDPCM mode, the process illustrated in FIG. 9 mayterminate.

The techniques described above, can be implemented as computer softwareusing computer-readable instructions and physically stored in one ormore computer-readable media. For example, FIG. 10 shows a computersystem (1000) suitable for implementing certain embodiments of thedisclosed subject matter.

The computer software can be coded using any suitable machine code orcomputer language, that may be subject to assembly, compilation,linking, or like mechanisms to create code comprising instructions thatcan be executed directly, or through interpretation, micro-codeexecution, and the like, by one or more computer central processingunits (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers orcomponents thereof, including, for example, personal computers, tabletcomputers, servers, smartphones, gaming devices, internet of thingsdevices, and the like.

The components shown in FIG. 10 for computer system (1000) are exemplaryin nature and are not intended to suggest any limitation as to the scopeof use or functionality of the computer software implementingembodiments of the present disclosure. Neither should the configurationof components be interpreted as having any dependency or requirementrelating to any one or combination of components illustrated in theexemplary embodiment of a computer system (1000).

Computer system (1000) may include certain human interface inputdevices. Such a human interface input device may be responsive to inputby one or more human users through, for example, tactile input (such as:keystrokes, swipes, data glove movements), audio input (such as: voice,clapping), visual input (such as: gestures), olfactory input (notdepicted). The human interface devices can also be used to capturecertain media not necessarily directly related to conscious input by ahuman, such as audio (such as: speech, music, ambient sound), images(such as: scanned images, photographic images obtain from a still imagecamera), video (such as two-dimensional video, three-dimensional videoincluding stereoscopic video).

Input human interface devices may include one or more of (only one ofeach depicted): keyboard (1001), mouse (1002), trackpad (1003), touchscreen (1010), data-glove (not shown), joystick (1005), microphone(1006), scanner (1007), camera (1008).

Computer system (1000) may also include certain human interface outputdevices. Such human interface output devices may be stimulating thesenses of one or more human users through, for example, tactile output,sound, light, and smell/taste. Such human interface output devices mayinclude tactile output devices (for example tactile feedback by thetouch-screen (1010), data-glove (not shown), or joystick (1005), butthere can also be tactile feedback devices that do not serve as inputdevices), audio output devices (such as: speakers (1009), headphones(not depicted)), visual output devices (such as screens (1010) toinclude CRT screens, LCD screens, plasma screens, OLED screens, eachwith or without touch-screen input capability, each with or withouttactile feedback capability—some of which may be capable to output twodimensional visual output or more than three dimensional output throughmeans such as stereographic output; virtual-reality glasses (notdepicted), holographic displays and smoke tanks (not depicted)), andprinters (not depicted).

Computer system (1000) can also include human accessible storage devicesand their associated media such as optical media including CD/DVD ROM/RW(1020) with CD/DVD or the like media (1021), thumb-drive (1022),removable hard drive or solid state drive (1023), legacy magnetic mediasuch as tape and floppy disc (not depicted), specialized ROM/ASIC/PLDbased devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computerreadable media” as used in connection with the presently disclosedsubject matter does not encompass transmission media, carrier waves, orother transitory signals.

Computer system (1000) can also include an interface to one or morecommunication networks. Networks can for example be wireless, wireline,optical. Networks can further be local, wide-area, metropolitan,vehicular and industrial, real-time, delay-tolerant, and so on. Examplesof networks include local area networks such as Ethernet, wireless LANs,cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TVwireline or wireless wide area digital networks to include cable TV,satellite TV, and terrestrial broadcast TV, vehicular and industrial toinclude CANBus, and so forth. Certain networks commonly require externalnetwork interface adapters that attached to certain general purpose dataports or peripheral buses (1049) (such as, for example USB ports of thecomputer system (1000)); others are commonly integrated into the core ofthe computer system (1000) by attachment to a system bus as describedbelow (for example Ethernet interface into a PC computer system orcellular network interface into a smartphone computer system). Using anyof these networks, computer system (1000) can communicate with otherentities. Such communication can be uni-directional, receive only (forexample, broadcast TV), uni-directional send-only (for example CANbus tocertain CANbus devices), or bi-directional, for example to othercomputer systems using local or wide area digital networks. Certainprotocols and protocol stacks can be used on each of those networks andnetwork interfaces as described above.

Aforementioned human interface devices, human-accessible storagedevices, and network interfaces can be attached to a core (1040) of thecomputer system (1000).

The core (1040) can include one or more Central Processing Units (CPU)(1041), Graphics Processing Units (GPU) (1042), specialized programmableprocessing units in the form of Field Programmable Gate Areas (FPGA)(1043), hardware accelerators for certain tasks (1044), and so forth.These devices, along with Read-only memory (ROM) (1045), Random-accessmemory (1046), internal mass storage such as internal non-useraccessible hard drives, SSDs, and the like (1047), may be connectedthrough a system bus (1048). In some computer systems, the system bus(1048) can be accessible in the form of one or more physical plugs toenable extensions by additional CPUs, GPU, and the like. The peripheraldevices can be attached either directly to the core's system bus (1048),or through a peripheral bus (1049). Architectures for a peripheral businclude PCI, USB, and the like.

CPUs (1041), GPUs (1042), FPGAs (1043), and accelerators (1044) canexecute certain instructions that, in combination, can make up theaforementioned computer code. That computer code can be stored in ROM(1045) or RAM (1046). Transitional data can also be stored in RAM(1046), whereas permanent data can be stored for example, in theinternal mass storage (1047). Fast storage and retrieve to any of thememory devices can be enabled through the use of cache memory, that canbe closely associated with one or more CPU (1041), GPU (1042), massstorage (1047), ROM (1045), RAM (1046), and the like.

The computer readable media can have computer code thereon forperforming various computer-implemented operations. The media andcomputer code can be those specially designed and constructed for thepurposes of the present disclosure, or they can be of the kind wellknown and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system havingarchitecture (1000), and specifically the core (1040) can providefunctionality as a result of processor(s) (including CPUs, GPUs, FPGA,accelerators, and the like) executing software embodied in one or moretangible, computer-readable media. Such computer-readable media can bemedia associated with user-accessible mass storage as introduced above,as well as certain storage of the core (1040) that are of non-transitorynature, such as core-internal mass storage (1047) or ROM (1045). Thesoftware implementing various embodiments of the present disclosure canbe stored in such devices and executed by core (1040). Acomputer-readable medium can include one or more memory devices orchips, according to particular needs. The software can cause the core(1040) and specifically the processors therein (including CPU, GPU,FPGA, and the like) to execute particular processes or particular partsof particular processes described herein, including defining datastructures stored in RAM (1046) and modifying such data structuresaccording to the processes defined by the software. In addition or as analternative, the computer system can provide functionality as a resultof logic hardwired or otherwise embodied in a circuit (for example:accelerator (1044)), which can operate in place of or together withsoftware to execute particular processes or particular parts ofparticular processes described herein. Reference to software canencompass logic, and vice versa, where appropriate. Reference to acomputer-readable media can encompass a circuit (such as an integratedcircuit (IC)) storing software for execution, a circuit embodying logicfor execution, or both, where appropriate. The present disclosureencompasses any suitable combination of hardware and software.

While this disclosure has described several exemplary embodiments, thereare alterations, permutations, and various substitute equivalents, whichfall within the scope of the disclosure. It will thus be appreciatedthat those skilled in the art will be able to devise numerous systemsand methods which, although not explicitly shown or described herein,embody the principles of the disclosure and are thus within the spiritand scope thereof.

(1) A method of video decoding performed in a video decoder, the methodincluding determining whether a first block associated with a secondblock is coded with a block differential pulse code modulation (BDPCM)mode, in response to determining that the first block is coded with theBDPCM mode, associating the first block with an intra prediction modevalue based on a BDPCM directional flag; determining an inter predictionmode value for the second block using the intra prediction mode valueassociated with the first block; and reconstructing the second blockusing the determined intra prediction mode value.

(2) The method according to feature (1), in which the BDPCM directionalflag is one of (i) a first value associated with a horizontal intraprediction directional mode, and (ii) a second value associated with avertical intra prediction directional mode.

(3) The method according to feature (2), in which the total number ofintra prediction modes is 67 with the horizontal intra predictiondirectional mode associated with angular mode 18 and with the verticalintra prediction directional mode associated with angular mode 50.

(4) The method according to any one of features (1)-(3), in whichdetermining whether the first block is coded with the BDPCM mode isbased on a value of a BDPCM flag that indicates the presence of theBDPCM directional flag.

(5) The method according to any one of features (1)-(4), in which thefirst block and second block are included in a same picture, and thefirst block spatially neighbors the second block.

(6) The method according to feature (5), further including: deriving forthe second block, using a most probable mode (MPM) derivation process, acandidate list, the deriving including the determining whether the firstblock is coded with the BDPCM mode, in which determining the interprediction mode value for the second block further includes using thederived candidate list.

(7) The method according to feature (6), in which the candidate listincludes a first candidate intra prediction mode value (Mode₁) thatcorresponds to the intra prediction mode of the first block, and asecond candidate intra prediction mode value (Mode₂) and a thirdcandidate intra prediction mode value (Mode₃) that are determined inaccordance with a predetermined offset from the first candidate intraprediction mode value and a modulo M operation, in which M is a power of2.

(8) The method according to any one of features (1)-(7), in which thesecond block is a chroma block and the first block is a luma blockco-located with the chroma block.

(9) The method according to feature (8), the method further includingdetermining whether the second block is coded with a direct copy mode(DM); and in response to determining that the second block is coded withthe direct copy mode, determining whether the first block is coded withthe BDPCM mode.

(10) A video decoder for video decoding, including processing circuitryconfigured to: determine whether a first block associated with a secondblock is coded with a block differential pulse code modulation (BDPCM)mode, in response to a determination that the first block is coded withthe BDPCM mode, associating the first block with an intra predictionmode value based on a BDPCM directional flag, determine an interprediction mode value for the second block using the intra predictionmode value associated with the first block, and reconstruct the secondblock using the determined intra prediction mode value.

(11) The video decoder according to feature (10), in which the BDPCMdirectional flag is one of (i) a first value associated with ahorizontal intra prediction directional mode, and (ii) a second valueassociated with a vertical intra prediction directional mode.

(12) The video decoder according to feature (11), in which the totalnumber of intra prediction modes is 67 with the horizontal intraprediction directional mode associated with angular mode 18 and with thevertical intra prediction directional mode associated with angular mode50.

(13) The video decoder according to any one of features (10)-(12), inwhich the determination whether the first block is coded with the BDPCMmode is based on a value of a BDPCM flag that indicates the presence ofthe BDPCM directional flag.

(14) The video decoder according to any one of features (10)-(13), inwhich the first block and second block are included in a same picture,and the first block spatially neighbors the second block.

(15) The video decoder according to feature (14), in which theprocessing circuitry is further configured to: derive for the secondblock, using a most probable mode (MPM) derivation process, a candidatelist, the derivation including the determination of whether the firstblock is coded with the BDPCM mode, in which the determination of theinter prediction mode value for the second block further includes usingthe derived candidate list.

(16) The video decoder according to feature (15), in which the candidatelist includes a first candidate intra prediction mode value (Mode₁) thatcorresponds to the intra prediction mode of the first block, and asecond candidate intra prediction mode value (Mode₂) and a thirdcandidate intra prediction mode value (Mode₃) that are determined inaccordance with a predetermined offset from the first candidate intraprediction mode value and a modulo M operation, in which M is a power of2.

(17) The video decoder according to any one of features (10), the inwhich the second block is a chroma block and the first block is a lumablock co-located with the chroma block.

(18) The video decoder according to feature (17), in which theprocessing circuitry is further configured to: determine whether thesecond block is coded with a direct copy mode (DM), and in response to adetermination that the second block is coded with the direct copy mode,determine whether the first block is coded with the BDPCM mode.

(19) A non-transitory computer readable medium having instructionsstored therein, which when executed by a processor in a video decodercauses the video decoder to execute a method including determiningwhether a first block associated with a second block is coded with ablock differential pulse code modulation (BDPCM) mode, in response todetermining that the first block is coded with the BDPCM mode,associating the first block with an intra prediction mode value based ona BDPCM directional flag; determining an inter prediction mode value forthe second block using the intra prediction mode value associated withthe first block; and reconstructing the second block using thedetermined intra prediction mode value.

(20) The non-transitory computer readable medium according to feature19, in which the BDPCM directional flag is one of (i) a first valueassociated with a horizontal intra prediction directional mode, and (ii)a second value associated with a vertical intra prediction directionalmode.

APPENDIX 1

-   -   If candIntraPredModeB is equal to candIntraPredModeA and        candIntraPredModeA is greater than INTRA_DC, candModeList[x]        with x=0 . . . 5 is derived as follows:        -   If IntraLumaRefLineIdx[xCb][yCb] is equal to 0, the            following applies:            candModeList[0]=candIntraPredModeA  (A1_4)            candModeList[1]=INTRA_PLANAR  (A1_5)            candModeList[2]=INTRA_DC  (A1_6)            candModeList[3]=2+((candIntraPredModeA+61)%64)  (A1_7)            candModeList[4]=2+((candIntraPredModeA−1)%64)  (A1_8)            candModeList[5]=2+((candIntraPredModeA+60)%64)  (A1_9)        -   Otherwise (IntraLumaRefLineIdx[xCb][yCb] is not equal to 0),            the following applies:            candModeList[0]=candIntraPredModeA  (A1_10)            candModeList[1]=2+((candIntraPredModeA+61)%64)  (A1_11)            candModeList[2]=2+((candIntraPredModeA−1)%64)  (A1_12)            candModeList[3]=2+((candIntraPredModeA+60)%64)  (A1_13)            candModeList[4]=2+(candIntraPredModeA %64)  (A1_14)            candModeList[5]=2+((candIntraPredModeA+59)%64)  (A1_15)    -   Otherwise if candIntraPredModeB is not equal to        candIntraPredModeA and candIntraPredModeA or candIntraPredModeB        is greater than INTRA_DC, the following applies:        -   The variables minAB and maxAB are derived as follows:            minAB=candModeList[(candModeList[0]>candModeList[1])?1:0]              (A1_16)            maxAB=candModeList[(candModeList[0]>candModeList[1])?0:1]              (A1_17)        -   If candIntraPredModeA and candIntraPredModeB are both            greater than INTRA_DC, candModeList[x] with x=0 . . . 5 is            derived as follows:            candModeList[0]=candIntraPredModeA  (A1_18)            candModeList[1]=candIntraPredModeB  (A1_19)            -   If IntraLumaRefLineIdx[xCb][yCb] is equal to 0, the                following applies:                candModeList[2]=INTRA_PLANAR  (A1_20)                candModeList[3]=INTRA_DC  (A1_21)                -   If maxAB−minAB is in the range of 2 to 62,                    inclusive, the following applies:                    candModeList[4]=2+((maxAB+61)%64)  (A1_22)                    candModeList[5]=2+((maxAB−1)%64)  (A1_23)                -   Otherwise, the following applies:                    candModeList[4]=2+((maxAB+60)%64)  (A1_24)                    candModeList[5]=2+((maxAB) % 64)  (A1_25)                -   Otherwise (IntraLumaRefLineIdx[xCb][yCb] is not                    equal to 0), the following applies:                -    If maxAB−minAB is equal to 1, the following                    applies:                    candModeList[2]=2+((minAB+61)%64)  (A1_26)                    candModeList[3]=2+((maxAB−1)%64)  (A1_27)                    candModeList[4]=2+((minAB+60)%64)  (A1_28)                    candModeList[5]=2+(maxAB %64)  (A1_29)                -    Otherwise if maxAB−minAB is equal to 2, the                    following applies:                    candModeList[2]=2+((minAB−1)%64)  (A1_30)                    candModeList[3]=2+((minAB+61)%64)  (A1_31)                    candModeList[4]=2+((maxAB−1)%64)  (A1_32)                    candModeList[5]=2+((minAB+60)%64)  (A1_33)                -    Otherwise if maxAB−minAB is greater than 61, the                    following applies:                    candModeList[2]=2+((minAB−1)%64)  (A1_34)                    candModeList[3]=2+((maxAB+61)%64)  (A1_35)                    candModeList[4]=2+(minAB % 64)  (A1_36)                    candModeList[5]=2+((maxAB+60)%64)  (A1_37)                -    Otherwise, the following applies:                    candModeList[2]=2+((minAB+61)%64)  (A1_38)                    candModeList[3]=2+((minAB−1)%64)  (A1_39)                    candModeList[4]=2+((maxAB+61)%64)  (A1_40)                    candModeList[5]=2+((maxAB−1)%64)  (A1_41)        -   Otherwise (candIntraPredModeA or candIntraPredModeB is            greater than INTRA_DC), candModeList[x] with x=0 . . . 5 is            derived as follows:            -   If IntraLumaRefLineIdx[xCb][yCb] is equal to 0, the                following applies:                candModeList[0]=candIntraPredModeA  (A1_42)                candModeList[1]=candIntraPredModeB  (A1_43)                candModeList[2]=1−minAB  (A1_44)                candModeList[3]=2+((maxAB+61)%64)  (A1_45)                candModeList[4]=2+((maxAB−1)%64)  (A1_46)                candModeList[5]=2+((maxAB+60)%64)  (A1_47)            -   Otherwise (IntraLumaRefLineIdx[xCb][yCb] is not equal to                0), the following applies:                candModeList[0]=maxAB  (A1_48)                candModeList[1]=2+((maxAB+61)%64)  (A1_49)                candModeList[2]=2+((maxAB−1)%64)  (A1_50)                candModeList[3]=2+((maxAB+60)%64)  (A1_51)                candModeList[4]=2+(maxAB %64)  (A1_52)                candModeList[5]=2+((maxAB+59)%64)  (A1_53)    -   Otherwise, the following applies:        -   If IntraLumaRefLineIdx[xCb][yCb] is equal to 0, the            following applies:            candModeList[0]=candIntraPredModeA  (A1_54)            candModeList[1]=(candModeList[0]==INTRA_PLANAR)?INTRA_DC:  (A1_55)            INTRA_PLANAR candModeList[2]=INTRA_ANGULAR50  (A1_56)            candModeList[3]=INTRA_ANGULAR18  (A1_57)            candModeList[4]=INTRA_ANGULAR46  (A1_58)            candModeList[5]=INTRA_ANGULAR54  (A1_59)        -   Otherwise (IntraLumaRefLineIdx[xCb][yCb] is not equal to 0),            the following applies:            candModeList[0]=INTRA_ANGULAR50  (A1_60)            candModeList[1]=INTRA_ANGULAR18  (A1_61)            candModeList[2]=INTRA_ANGULAR2  (A1_62)            candModeList[3]=INTRA_ANGULAR34  (A1_63)            candModeList[4]=INTRA_ANGULAR66  (A1_64)            candModeList[5]=INTRA_ANGULAR26  (A1_65)

APPENDIX 2

IntraPredModeY[xCb][yCb] is derived by the following ordered steps:

-   -   1. The neighbouring locations (xNbA, yNbA) and (xNbB, yNbB) are        set equal to (xCb−1, yCb+cbHeight−1) and (xCb+cbWidth−1, yCb−1),        respectively.    -   2. For X being replaced by either A or B, the variables        candIntraPredModeX are derived as follows:        -   The availability derivation process for a block is invoked            with the location (xCurr, yCurr) set equal to (xCb, yCb) and            the neighbouring location (xNbY, yNbY) set equal to (xNbX,            yNbX) as inputs, and the output is assigned to availableX.        -   The candidate intra prediction mode candIntraPredModeX is            derived as follows:            -   If one or more of the following conditions are true,                candIntraPredModeX is set equal to INTRA_PLANAR.                -   The variable availableX is equal to FALSE.                -   CuPredMode[xNbX][yNbX] is not equal to MODE INTRA                    and ciip_flag[xNbX][yNbX] is not equal to 1.                -   pcm_flag[xNbX][yNbX] is equal to 1.                -   X is equal to B and yCb−1 is less than                    ((yCb>>CtbLog2SizeY)<<CtbLog2SizeY).            -   Otherwise, candIntraPredModeX is set equal to                IntraPredModeY[xNbX][yNbX].    -   3. The variables ispDefaultMode1 and ispDefaultMode2 are defined        as follows:        -   If IntraSubPartitionsSplitType is equal to ISP_HOR_SPLIT,            ispDefaultMode1 is set equal to INTRA_ANGULAR18 and            ispDefaultMode2 is set equal to INTRA_ANGULAR5.        -   Otherwise, ispDefaultMode1 is set equal to INTRA_ANGULAR50            and ispDefaultMode2 is set equal to INTRA_ANGULAR63.    -   4. The candModeList[x] with x=0.5 is derived as follows:        -   If candIntraPredModeB is equal to candIntraPredModeA and            candIntraPredModeA is greater than INTRA_DC, candModeList[x]            with x=0 . . . 5 is derived as follows:            -   If IntraLumaRefLineIdx[xCb][yCb] is equal to 0 and                IntraSubPartitionsSplitType is equal to ISP_NO_SPLIT,                the following applies:                candModeList[0]=candIntraPredModeA  (A2_9)                candModeList[1]=INTRA_PLANAR  (A2_10)                candModeList[2]=INTRA_DC  (A2_11)                candModeList[3]=2+((candIntraPredModeA+61)%64)  (A2_12)                candModeList[4]=2+((candIntraPredModeA−1)%64)  (A2_13)                candModeList[5]=2+((candIntraPredModeA+60)%64)  (A2_14)            -   Otherwise (IntraLumaRefLineIdx[xCb][yCb] is not equal to                0 or IntraSubPartitionsSplitType is not equal to                ISP_NO_SPLIT), the following applies:                candModeList[0]=candIntraPredModeA  (A2_15)                candModeList[1]=2+((candIntraPredModeA+61)%64)  (A2_16)                candModeList[2]=2+((candIntraPredModeA−1)%64)  (A2_17)                -   If one of the following conditions is true,                -    IntraSubPartitionsSplitType is equal to                    ISP_HOR_SPLIT and candIntraPredModeA is less than                    INTRA_ANGULAR34,                -    IntraSubPartitionsSplitType is equal to                    ISP_VER_SPLIT and candIntraPredModeA is greater than                    or equal to INTRA_ANGULAR34,                -    IntraLumaRefLineIdx[xCb][yCb] is not equal to 0,                -   the following applies:                    candModeList[3]=2+((candIntraPredModeA+60)%64)  (A2_18)                    candModeList[4]=2+(candIntraPredModeA %64)  (A2_19)                    candModeList[5]=2+((candIntraPredModeA+59)%64)  (A2_20)                -    Otherwise, the following applies:                    candModeList[3]=ispDefaultMode1  (A2_21)                    candModeList[4]=ispDefaultMode2  (A2_22)                    candModeList[5]=INTRA_PLANAR  (A2_23)                -   Otherwise if candIntraPredModeB is not equal to                    candIntraPredModeA and candIntraPredModeA or                    candIntraPredModeB is greater than INTRA_DC, the                    following applies:                -    The variables minAB and maxAB are derived as                    follows:                    minAB=Min(candIntraPredModeA,candIntraPredModeB)  (A2_24)                    maxAB=Max(candIntraPredModeA,candIntraPredModeB)  (A2_25)                -    If candIntraPredModeA and candIntraPredModeB are                    both greater than INTRA_DC, candModeList[x] with x=0                    . . . 5 is derived as follows:                    candModeList[0]=candIntraPredModeA  (A2_26)                    candModeList[1]=candIntraPredModeB  (A2_27)                -    If IntraLumaRefLineIdx[xCb][yCb] is equal to 0 and                    IntraSubPartitionsSplitType is equal to                    ISP_NO_SPLIT, the following applies:                    candModeList[2]=INTRA_PLANAR  (A2_28)                    candModeList[3]=INTRA_DC  (A2_29)                -    If maxAB−minAB is in the range of 2 to 62,                    inclusive, the following applies:                    candModeList[4]=2+((maxAB+61)%64)  (A2_30)                    candModeList[5]=2+((maxAB−1)%64)  (A2_31)                -    Otherwise, the following applies:                    candModeList[4]=2+((maxAB+60)%64)  (A2_32)                    candModeList[5]=2+((maxAB) %64)  (A2_33)                -   Otherwise (IntraLumaRefLineIdx[xCb][yCb] is not                    equal to 0 or IntraSubPartitionsSplitType is not                    equal to ISP_NO_SPLIT), the following applies:                -    When IntraSubPartitionsSplitType is not equal to                    ISP_NO_SPLIT, and                    abs(candIntraPredModeB−ispDefaultMode1) is less than                    abs(candIntraPredModeA−ispDefaultMode1), the                    following applies:                    candModeList[0]=candIntraPredModeB  (A2_34)                    candModeList[1]=candIntraPredModeA  (A2_35)                -    If maxAB−minAB is equal to 1, the following                    applies:                    candModeList[2]=2+((minAB+61)%64)  (A2_36)                    candModeList[3]=2+((maxAB−1)%64)  (A2_37)                    candModeList[4]=2+((minAB+60)%64)  (A2_38)                    candModeList[5]=2+(maxAB %64)  (A2_39)                -    Otherwise if maxAB−minAB is equal to 2, the                    following applies:                    candModeList[2]=2+((minAB−1)%64)  (A2_40)                    candModeList[3]=2+((minAB+61)%64)  (A2_41)                    candModeList[4]=2+((maxAB−1)%64)  (A2_42)                    candModeList[5]=2+((minAB+60)%64)  (A2_43)                -    Otherwise if maxAB−minAB is greater than 61, the                    following applies:                    candModeList[2]=2+((minAB−1)%64)  (A2_44)                    candModeList[3]=2+((maxAB+61)%64)  (A2_45)                    candModeList[4]=2+(minAB %64)  (A2_46)                    candModeList[5]=2+((maxAB+60)%64)  (A2_47)                -    Otherwise, the following applies:                    candModeList[2]=2+((minAB+61)%64)  (A2_48)                    candModeList[3]=2+((minAB−1)%64)  (A2_49)                    candModeList[4]=2+((maxAB+61)%64)  (A2_50)                    candModeList[5]=2+((maxAB−1)%64)  (A2_51)                -    Otherwise (candIntraPredModeA or candIntraPredModeB                    is greater than INTRA_DC), candModeList[x] with x=0                    . . . 5 is derived as follows:                -    If IntraLumaRefLineIdx[xCb][yCb] is equal to 0 and                    IntraSubPartitionsSplitType is equal to                    ISP_NO_SPLIT, the following applies:                    candModeList[0]=candIntraPredModeA  (A2_52)                    candModeList[1]=candIntraPredModeB  (A2_53)                    candModeList[2]=1−minAB  (A2_54)                    candModeList[3]=2+((maxAB+61)%64)  (A2_55)                    candModeList[4]=2+((maxAB−1)%64)  (A2_56)                    candModeList[5]=2+((maxAB+60)%64)  (A2_57)                -    Otherwise, if IntraLumaRefLineIdx[xCb][yCb] is not                    equal to 0, the following applies:                    candModeList[0]=maxAB  (A2_58)                    candModeList[1]=2+((maxAB+61)%64)  (A2_59)                    candModeList[2]=2+((maxAB−1)%64)  (A2_60)                    candModeList[3]=2+((maxAB+60)%64)  (A2_61)                    candModeList[4]=2+(maxAB %64)  (A2_62)                    candModeList[5]=2+((maxAB+59)%64)  (A2_63)                -    Otherwise (IntraSubPartitionsSplitType is not equal                    to ISP_NO_SPLIT), the following applies:                    candModeList[0]=INTRA_PLANAR  (A2_64)                    candModeList[1]=maxAB  (A2_65)                    candModeList[2]=2+((maxAB+61)%64)  (A2_66)                    candModeList[3]=2+((maxAB−1)%64)  (A2_67)                    candModeList[4]=2+((maxAB+60)%64)  (A2_68)                    candModeList[5]=2+(maxAB %64)  (A2_69)                -   Otherwise, the following applies:                -    If IntraLumaRefLineIdx[xCb][yCb] is equal to 0 and                    IntraSubPartitionsSplitType is equal to                    ISP_NO_SPLIT, the following applies:                    candModeList[0]=candIntraPredModeA  (A2_70)                    candModeList[1]=(candModeList[0]==INTRA_PLANAR)?INTRA_DC:  (A2_71)                    INTRA_PLANAR                    candModeList[2]=INTRA_ANGULAR50  (A2_72)                    candModeList[3]=INTRA_ANGULAR18  (A2_73)                    candModeList[4]=INTRA_ANGULAR46  (A2_74)                    candModeList[5]=INTRA_ANGULAR54  (A2_75)                -    Otherwise, if IntraLumaRefLineIdx[xCb][yCb] is not                    equal to 0, the following applies:                    candModeList[0]=INTRA_ANGULAR50  (A2_76)                    candModeList[1]=INTRA_ANGULAR18  (A2_77)                    candModeList[2]=INTRA_ANGULAR2  (A2_78)                    candModeList[3]=INTRA_ANGULAR34  (A2_79)                    candModeList[4]=INTRA_ANGULAR66  (A2_80)                    candModeList[5]=INTRA_ANGULAR26  (A2_81)                -    Otherwise, if IntraSubPartitionsSplitType is equal                    to ISP_HOR_SPLIT, the following applies:                    candModeList[0]=INTRA_PLANAR  (A2_82)                    candModeList[1]=INTRA_ANGULAR18  (A2_83)                    candModeList[2]=INTRA_ANGULAR25  (A2_84)                    candModeList[3]=INTRA_ANGULAR10  (A2_85)                    candModeList[4]=INTRA_ANGULAR65  (A2_86)                    candModeList[5]=INTRA_ANGULAR50  (A2_87)                -    Otherwise, if IntraSubPartitionsSplitType is equal                    to ISP_VER_SPLIT, the following applies:                    candModeList[0]=INTRA_PLANAR  (A2_88)                    candModeList[1]=INTRA_ANGULAR50  (A2_89)                    candModeList[2]=INTRA_ANGULAR43  (A2_90)                    candModeList[3]=INTRA_ANGULAR60  (A2_91)                    candModeList[4]=INTRA_ANGULAR3  (A2_92)                    candModeList[5]=INTRA_ANGULAR18  (A2_93)    -   5. IntraPredModeY[xCb][yCb] is derived by applying the following        procedure:        -   If bdpcm_flag[xCb][yCb] is equal to 1, the            IntraPredModeY[xCb][yCb] is set equal to            bdpcm_dir_flag[xCb][yCb]==0 ? INTRA_ANGULAR18:            INTRA_ANGULAR50.        -   Otherwise if intra_luma_mpm_flag[xCb][yCb] is equal to 1,            the IntraPredModeY[xCb][yCb] is set equal to            candModeList[intra_luma_mpm_idx[xCb][yCb].        -   Otherwise, IntraPredModeY[xCb][yCb] is derived by applying            the following ordered steps:            -   1. When candModeList[i] is greater than candModeList[j]                for i=0.4 and for each i, j=(i+1) . . . 5, both values                are swapped as follows:                (candModeList[i],candModeList[j])=Swap(candModeList[i],candModeList[j])  (A2_94)            -   2. IntraPredModeY[xCb][yCb] is derived by the following                ordered steps:                -   i. IntraPredModeY[xCb][yCb] is set equal to                    intra_luma_mpm_remainder[xCb][yCb].                -   ii. For i equal to 0 to 5, inclusive, when                    IntraPredModeY[xCb][yCb] is greater than or equal to                    candModeList[i], the value of                    IntraPredModeY[xCb][yCb] is incremented by one.                    The variable IntraPredModeY[x][y] with x=xCb . . .                    xCb+cbWidth−1 and y=yCb . . . yCb+cbHeight−1 is set                    to be equal to IntraPredModeY[xCb][yCb].

What is claimed is:
 1. A method of video encoding, the methodcomprising: determining, by processing circuitry of a video encoder,whether a first block associated with a second block is to be predictedaccording to a block differential pulse code modulation (BDPCM) mode; inresponse to determining that the first block is to be predictedaccording to the BDPCM mode, associating the first block with an intraprediction mode value based on a BDPCM direction for the first block,the intra prediction mode value being selected from a plurality of intraprediction modes that include angular intra prediction modes;determining an intra prediction mode value for the second block usingthe intra prediction mode value associated with the first block; andencoding the second block using the determined intra prediction modevalue for the second block.
 2. The method according to claim 1, whereinthe BDPCM direction is one of (i) a horizontal intra predictiondirectional mode, or (ii) a vertical intra prediction directional mode.3. The method according to claim 2, wherein a total number of theplurality of intra prediction modes is 67 with the horizontal intraprediction directional mode being associated with angular intraprediction mode 18 and the vertical intra prediction directional modebeing associated with angular intra prediction mode
 50. 4. The methodaccording to claim 1, further comprising, in response to a determinationthat the first block is predicted according to the BDPCM mode,generating prediction information including a value of a BDPCM flag forthe first block, the value indicating a presence of a BDPCM directionalflag for the first block, the BDPCM directional flag indicating theBDPCM direction.
 5. The method according to claim 1, wherein the firstblock and the second block are included in a same picture, and the firstblock spatially neighbors the second block.
 6. The method according toclaim 5, further comprising: deriving for the second block, using a mostprobable mode (MPM) derivation process, a candidate list, the candidatelist being derived based on the determination of whether the first blockis predicted according to the BDPCM mode, wherein the determining theintra prediction mode value for the second block includes using thederived candidate list.
 7. The method according to claim 6, wherein thecandidate list includes a first candidate intra prediction mode valuethat corresponds to the intra prediction mode value of the first block,and a second candidate intra prediction mode value and a third candidateintra prediction mode value that are determined in accordance with apredetermined offset from the first candidate intra prediction modevalue and a modulo M operation, in which M is a power of
 2. 8. Themethod according to claim 1, wherein the second block is a chroma blockand the first block is a luma block co-located with the chroma block. 9.The method according to claim 8, further comprising: determining whetherthe second block is coded with a direct copy mode (DM); and in responseto (i) a determination that the second block is coded with the directcopy mode and (ii) a determination that the first block is predictedaccording to the BDPCM mode, using the intra prediction mode valueassociated with the first block as the intra prediction mode value ofthe second block.
 10. A video encoder for video encoding, comprising:processing circuitry configured to: determine whether a first blockassociated with a second block is to be predicted according to a blockdifferential pulse code modulation (BDPCM) mode; in response to adetermination that the first block is to be predicted according to theBDPCM mode, associate the first block with an intra prediction modevalue based on a BDPCM direction for the first block, the intraprediction mode value being selected from a plurality of intraprediction modes that include angular intra prediction modes; determinean intra prediction mode value for the second block using the intraprediction mode value associated with the first block; and encode thesecond block using the determined intra prediction mode value for thesecond block.
 11. The video encoder according to claim 10, wherein theBDPCM direction is one of (i) a horizontal intra prediction directionalmode, or (ii) a vertical intra prediction directional mode.
 12. Thevideo encoder according to claim 11, wherein a total number of theplurality of intra prediction modes is 67 with the horizontal intraprediction directional mode being associated with angular intraprediction mode 18 and the vertical intra prediction directional modebeing associated with angular intra prediction mode
 50. 13. The videoencoder according to claim 10, wherein the processing circuitry isfurther configured to, in response to a determination that the firstblock is predicted according to the BDPCM mode, generate predictioninformation including a value of a BDPCM flag for the first block, thevalue indicating a presence of a BDPCM directional flag for the firstblock, the BDPCM directional flag indicating the BDPCM direction. 14.The video encoder according to claim 10, wherein the first block and thesecond block are included in a same picture, and the first blockspatially neighbors the second block.
 15. The video encoder according toclaim 14, wherein the processing circuitry is further configured to:derive for the second block, using a most probable mode (MPM) derivationprocess, a candidate list, the candidate list being derived based on thedetermination of whether the first block is predicted according to theBDPCM mode, wherein the processing circuitry determines the intraprediction mode value for the second block by using the derivedcandidate list.
 16. The video encoder according to claim 15, wherein thecandidate list includes a first candidate intra prediction mode valuethat corresponds to the intra prediction mode value of the first block,and a second candidate intra prediction mode value and a third candidateintra prediction mode value that are determined in accordance with apredetermined offset from the first candidate intra prediction modevalue and a modulo M operation, in which M is a power of
 2. 17. Thevideo encoder according to claim 10, wherein the second block is achroma block and the first block is a luma block co-located with thechroma block.
 18. The video encoder according to claim 17, wherein theprocessing circuitry is further configured to: determine whether thesecond block is coded with a direct copy mode (DM); and in response to(i) a determination that the second block is coded with the direct copymode and (ii) a determination that the first block is predictedaccording to the BDPCM mode, use the intra prediction mode valueassociated with the first block as the intra prediction mode value ofthe second block.
 19. A non-transitory computer readable medium havinginstructions stored therein, which, when executed by a processor in avideo encoder, cause the video encoder to execute a method comprising:determining whether a first block associated with a second block ispredicted according to a block differential pulse code modulation(BDPCM) mode, in response to determining that the first block is to bepredicted according to the BDPCM mode, associating the first block withan intra prediction mode value based on a BDPCM direction for the firstblock, the intra prediction mode value being selected from a pluralityof intra prediction modes that include angular intra prediction modes;determining an intra prediction mode value for the second block usingthe intra prediction mode value associated with the first block; andencoding the second block using the determined intra prediction modevalue for the second block.
 20. The non-transitory computer readablemedium according to claim 19, wherein the BDPCM direction is one of (i)a horizontal intra prediction directional mode, or (ii) a vertical intraprediction directional mode.